Square Root Palindromes
ثبت نشده
چکیده
Square Root Palindromes ................................... 1 Sigma Quest .......................................................... 6 Decimal Fractions ................................................ 9 Designing Weavable Color Patterns ............... 12 Polygraphic Substitution .................................. 17 Programming Tips ............................................. 20 What’s Coming Up ............................................ 20
منابع مشابه
In-Depth Coverage of the Icon Programming Language and Applications Constant Square-Root Palindromes
In the last issue of the Analyst, we described an application, which we have named qirplore, for exploring the space of square-root palindromes — the palindromic parts of the repeats in continuedfraction sequences for square roots [1]. In this article we’ll use qirplore to gather information about constant square-root palindromes — palindromes in which all terms are the same — and then deduce s...
متن کاملIn-Depth Coverage of the Icon Programming Language and Applications Solving Square-Root Palindromes
In the last article on square-root palindromes [1], we investigated constant square-root palindromes (those in which all terms are the same) using a combination of programs, guesses, and deduction. In this article, we’ll take a different approach: solving continued fractions to get data from which to derive more information about square-root palindromes. In a previous article [2], we showed a m...
متن کاملRich and Periodic-Like Words
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with periodic-like words. In particular, some new characterizations of rich words and rich palindromes are given. We also prove that a periodic-like word is rich if and only if the square of its fractional root is also rich.
متن کاملFinding Maximal 2-Dimensional Palindromes
This paper extends the problem of palindrome searching into a higher dimension, addressing two definitions of 2D palindromes. The first definition implies a square, while the second definition (also known as a centrosymmetric factor), can be any rectangular shape. We describe two algorithms for searching a 2D text for maximal palindromes, one for each type of 2D palindrome. The first algorithm ...
متن کاملOptimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
of results Optimal concurrent-read concurrent-write parallel algorithms for two problems are presented: Finding all the periods of a string. The period of a string can be computed by previous eecient parallel algorithms only if it is shorter than half of the length of the string. Our new algorithm computes all the periods in optimal O(loglog n) time, even if they are longer. The algorithm can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000